Centralized collision-free polynomial trajectories and goal assignment for aerial swarms

نویسندگان

چکیده

Computationally tractable methods are developed for centralized goal assignment and planning of collision-free polynomial-in-time trajectories systems multiple aerial robots. The method first assigns robots to goals minimize total time-in-motion based on initial trajectories. By coupling the trajectory generation, motion plans tend require only limited collision resolution. then refined by checking potential collisions resolving them using either start time delays or altitude assignment. Numerical experiments both show significant reductions in required agents arrive at with modest additional computational effort comparison state-of-the-art prior work, enabling thousands agents.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aerial robot swarms

Vijay Kumar (www.seas.upenn.edu/~kumar) studies collective behaviors in biological and robotic systems. He and his research group design novel architectures, create abstractions for systems of interacting individuals, and develop new algorithms for cooperating robots. The overarching themes in his research include modeling nature and developing bioinspired architectures and algorithms, understa...

متن کامل

Dynamic Envelopes and Robustly, Continuously Collision-free Trajectories

In an unpredictable real-world environment, how the objects move is usually not known beforehand. Thus, whether a robot trajectory is safely collision-free or not has to be tested on-line based on sensing as the robot moves in the environment and taking into account robot motion uncertainty. The problem is more challenging if the robot has a high degree of freedom, such as a mobile manipulator....

متن کامل

Goal Assignment and Trajectory Planning for Large Teams of Aerial Robots

This paper presents a computationally tractable, resolution-complete algorithm for generating dynamically feasible trajectories for N interchangeable (identical) aerial robots navigating through cluttered known environments to M goal states. This is achieved by assigning the robots to goal states while concurrently planning the trajectories for all robots. The algorithm minimizes the maximum co...

متن کامل

Aerial Human-Comfortable Collision-free Navigation in Dense Environments

With current overuse of the road transportation system and planned increase in traffic, innovative solutions that overcome environmental and financial cost of the current system should be assessed. A promising idea is the use of the third dimension for personal transportation. Therefore, the European project myCopter, funded under the 7th framework, aimed at enabling the technologies for Person...

متن کامل

Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization

We present a novel approach for incorporating collision avoidance into trajectory optimization as a method of solving robotic motion planning problems. At the core of our approach are (i) A sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary. (ii) An efficient formulation of the no-collisions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Control Engineering Practice

سال: 2021

ISSN: ['1873-6939', '0967-0661']

DOI: https://doi.org/10.1016/j.conengprac.2021.104753